Summation algorithms for Stirling number identities
نویسندگان
چکیده
منابع مشابه
Summation algorithms for Stirling number identities
We consider a class of sequences defined by triangular recurrence equations. This class contains Stirling numbers and Eulerian numbers of both kinds, and hypergeometric multiples of those. We give a sufficient criterion for sums over such sequences to obey a recurrence equation, and present algorithms for computing such recurrence equations efficiently. Our algorithms can be used for verifying ...
متن کاملMultiple Stirling Number Identities
A remarkable multiple analogue of the Stirling numbers of the first and second kind was recently constructed by the author. Certain summation identities, and related properties of this family of multiple special numbers are investigated in the present paper.
متن کاملAutomated Proofs for Some Stirling Number Identities
We present computer-generated proofs of some summation identities for (q-)Stirling and (q-)Eulerian numbers that were obtained by combining a recent summation algorithm for Stirling number identities with a recurrence solver for difference fields.
متن کاملq-Stirling Identities Revisited
We give combinatorial proofs of q-Stirling identities using restricted growth words. This includes a poset theoretic proof of Carlitz’s identity, a new proof of the q-Frobenius identity of Garsia and Remmel and of Ehrenborg’s Hankel q-Stirling determinantal identity. We also develop a two parameter generalization to unify identities of Mercier and include a symmetric function version.
متن کاملSummation Formulae and Stirling Numbers
We exploit methods of operational and combinatorial nature to get a class of summation formulae involving special functions and polynomi-als. The results obtained in this paper complete and integrate previous investigations obtained with different methods.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2007
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2007.08.002